Integrating Edge Routing into Force-Directed Layout
نویسندگان
چکیده
Force-directed layout is typically used to create organic-looking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for high-quality layout of small to medium sized graphs. In this paper we integrate edge-routing techniques into a forcedirected layout method based on constrained stress majorisation. Our basic procedure takes an initial layout for the graph, including poly-line paths for the edges, and improves this layout by moving the nodes to reduce stress and moving edge bend points to straighten the edges and reduce their overall length. Separation constraints between nodes and edge bend points are used to ensure that node labels do not overlap edges or other nodes and that no additional edge crossings are introduced.
منابع مشابه
Drawing layered graphs with port constraints
Complex software systems are often modeled using data flow diagrams, in which nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node. In this paper we present approaches for integrating port constraints into the layer-based approach to g...
متن کاملFast Layout Methods for Timetable Graphs
In this paper, we present a fast layout algorithm using an entirely different approa h to edge routing, based on dire tions of ontrol segments rather than positions of ontrol points. We reveal an interesting theoreti al onne tion with Tutte's bary entri layout method [18℄, and our omputational studies show that this new approa h yields satisfa tory layouts even for huge timetable graphs within ...
متن کاملTowards a Vertex and Edge Label Aware Force Directed Layout Algorithm
Many automatic graph layout algorithms can cause shaped vertices and edge labels (which have a size when drawn on the screen) to overlap in the resulting visualisation. Overlaps can hide information that users expect to see in cases where the graph is small. We perform two experiments on a large real-world set of small (10-110 vertex) graphs to compare how different combinations of forces in Ea...
متن کاملCAPD - computer-aided plant design
The layout of chemical plants has to take into consideration boundary conditions and requirements of many different engineering fields. In order to assist the design engineer at an early stage during the extended basic engineering, a system for computer aided plant design has been developed. It contains modules for •extended equipment models including equipment related piping and areas for main...
متن کاملGM Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques
In this paper, the gate matrix layout is formulated as a planning problem where a "plan" (the solution steps) is generated to achieve a "goal" (the gate matrix layout) that consists of subgoals interacting each other. Each subgoal corresponds to the placement of a gate to a slot. or to the routing of a net connecting gates. The interaction among subgoals is managed with two AI planning techniqu...
متن کامل